منابع مشابه
Short Certificates for Tournaments
An isomorphism certificate of a labeled tournament T is a labeled subdigraph of T which together with an unlabeled copy of T allows the errorless reconstruction of T . It is shown that any tournament on n vertices contains an isomorphism certificate with at most n log2 n edges. This answers a question of Fishburn, Kim and Tetali. A score certificate of T is a labeled subdigraph of T which toget...
متن کاملShort Score Certificates for Upset Tournaments
A score certificate for a tournament, T , is a collection of arcs of T which can be uniquely completed to a tournament with the same scorelist as T ’s, and the score certificate number of T is the least number of arcs in a score certificate of T . Upper bounds on the score certificate number of upset tournaments are derived. The upset tournaments on n vertices are in one–to–one correspondence w...
متن کاملLocal Tournaments and In - Tournaments
Preface Tournaments constitute perhaps the most well-studied class of directed graphs. One of the reasons for the interest in the theory of tournaments is the monograph Topics on Tournaments [58] by Moon published in 1968, covering all results on tournaments known up to this time. In particular, three results deserve special mention: in 1934 Rédei [60] proved that every tournament has a directe...
متن کاملTournaments for Ideas
Governments and foundations have successfully harnessed tournaments to spur innovation. Yet this tool is not widely used by firms. We offer a framework for managers seeking to organize tournaments for ideas. We present the theoretical underpinnings of tournaments. We then connect the theory with three recent innovations—the power of the network, the wisdom of crowds, and the power of love—that ...
متن کاملCertificates Talk about certificates in QE
Today we continue with some additional aspects of quantifier elimination. We will then recall the Positivstellensatz and its relations with semidefinite programming. After introducing copositive matrices, we present Pólya’s theorem on positive forms on the simplex, and the associated relaxations. Finally, we conclude with an important result due to Schmüdgen about representation of positive pol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1997
ISSN: 1077-8926
DOI: 10.37236/1297